Record-dependent measures on the symmetric groups
نویسندگان
چکیده
منابع مشابه
Record-dependent measures on the symmetric groups
A probability measure Pn on the symmetric group Sn is said to be record-dependent if Pn(σ) depends only on the set of records of a permutation σ ∈ Sn. A sequence P = (Pn)n∈N of consistent recorddependent measures determines a random order on N. In this paper we describe the extreme elements of the convex set of such P . This problem turns out to be related to the study of asymptotic behavior of...
متن کاملAsymptotics of Plancherel Measures for Symmetric Groups
1.1. Plancherel measures. Given a finite group G, by the corresponding Plancherel measure we mean the probability measure on the set G∧ of irreducible representations of G which assigns to a representation π ∈ G∧ the weight (dim π)/|G|. For the symmetric group S(n), the set S(n)∧ is the set of partitions λ of the number n, which we shall identify with Young diagrams with n squares throughout th...
متن کاملOn the Genus of Symmetric Groups
A new method for determining genus of a group is described. It involves first getting a bound on the sizes of the generating set for which the corresponding Cayley graph could have smaller genus. The allowable generating sets are then examined by methods of computing average face sizes and by voltage graph techniques to find the best embeddings. This method is used to show that genus of the sym...
متن کاملOn the decomposition map for symmetric groups
Let R be the Z-module generated by the irreducible characters of the symmetric group Sd . We determine bases for the kernel of the decomposition map. It is known that R ⊗Z F is isomorphic to the radical quotient of the Solomon descent algebra when F is a field of characteristic zero. We show that when F has prime characteristic and I d br is the kernel of the decomposition map for prime p then ...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2014
ISSN: 1042-9832
DOI: 10.1002/rsa.20526